package com.leetcode.No0032;

import org.junit.Test;

/**
 * @program: leetcode
 * @description: 最长有效括号 堆栈
 * @author: wangzhihua
 * @date: 2021-06-27
 */
public class Solution04 {

	@Test
	public void test01() {
		System.out.println(longestValidParentheses(""));
		System.out.println(longestValidParentheses("(()"));
		System.out.println(longestValidParentheses(")()())"));
		System.out.println(longestValidParentheses("()()()"));
		System.out.println(longestValidParentheses("(()()(())(("));
		System.out.println(longestValidParentheses("))))())()()(()"));
	}

	public int longestValidParentheses(String s) {
		int ans = 0;
		return ans;
	}

}
